Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (6): 93-96.doi: 10.13190/jbupt.200906.93.chench

• Reports • Previous Articles     Next Articles

Nonbinary Quasi-Cyclic LDPC Codes with Efficient Richardson-Urbanke Encoding Algorithm

CHEN Chao;BAI Bao-ming;WANG Xin-mei   

  1. (State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China)
  • Received:2009-02-15 Revised:2009-09-28 Online:2009-12-28 Published:2009-12-28
  • Contact: CHEN Chao

Abstract:

In order to implement efficient encoding, a class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed, which can be encoded with Richardson-Urbanke algorithm. The right part of the parity-check matrix has weight-2 columns, which allows the construction of both regular and irregular codes. Constraints on the parity-check matrix ensure a linear encoding complexity. Simulation results show that the proposed codes, when combined with higher order modulation, perform favorably with the codes constructed by the progressive-edge-growth (PEG) constructed code and close to the Shannon limits.

Key words: low-density parity-check codes, nonbinary, quasi-cyclic, Richardson-Urbanke algorithm, spectral efficiency, Shannon limit